例句與造句

1. Brownian trees arise as limits of various random processes on finite trees.
2. The rules typically are expressed in terms of finite trees of formulas.
3. As with classical automata, finite tree automata ( FTA ) can be either a deterministic automaton or not.
4. More generally the following property shows that any finite subset of an hyperbolic space looks like a finite tree.
5. The Kleene Brouwer order generalizes the notion of a postorder traversal from finite trees to trees that are not necessarily finite.
6. It's difficult to find finite tree in a sentence. 用finite tree造句挺難的
7. Then the Cayley graph of F with respect to S is a locally finite Tree ( graph theory ) and hence a 0-hyperbolic space.
8. According to how the automaton processes the input tree, finite tree automata can be of two types : ( a ) bottom up, ( b ) top down.
9. For example, unification is used for finite tree equalities, variable elimination for polynomial equations over reals, constraint propagation to enforce a form of local consistency for finite domains.
10. More generally we see that any group G which acts properly discontinuously on a locally finite tree ( in this context this means exactly that the stabilizers in G of the vertices are finite ) is hyperbolic.
11. In the pseudoholomorphic curves in an almost complex manifold with a uniform energy bound must have a subsequence which limits to a pseudoholomorphic curve which may have nodes or ( a finite tree of ) " bubbles ".
12. For a discrete subgroup " G " of the automorphism group of a locally finite tree " X " one can define a natural notion of " volume " for the quotient graph of groups "'A "'as
13. Gentzen's proof is arguably finitistic, since the transfinite ordinal ? 0 can be encoded in terms of finite objects ( for example, as a Turing machine describing a suitable order on the integers, or more abstractly as consisting of the finite trees, suitably linearly ordered ).
14. Notably, given an infinite tree, the corecursive breadth-first traversal will traverse all nodes, just as for a finite tree, while the recursive depth-first traversal will go down one branch and not traverse all nodes, and indeed if traversing post-order, as in this example ( or in-order ), it will visit no nodes at all, because it never reaches a leaf.